Novel RNS-to-binary converters for the three-moduli set {2m − 1, 2m, 2m + 1}

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Bogdanov-Takens bifurcation study of 2m coupled neurons system with 2m+1$2m+1$ delays

In this paper the Bogdanov-Takens (BT) bifurcation of an 2m coupled neurons network model with multiple delays is studied, where one neuron is excitatory and the next is inhibitory. When the origin of the model has a double zero eigenvalue, by using center manifold reduction of delay differential equations (DDEs), the second-order and third-order universal unfoldings of the normal forms are ded...

متن کامل

On the nonexistence of $[\binom{2m}{m-1}, 2m, \binom{2m-1}{m-1}]$, $m$ odd, complex orthogonal design

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled by ±zi or ±z ∗ i , i = 1, 2, . . . , k, such that O H z Oz = (|z1| 2 + |z2| 2 + . . . + |zk| 2)In×n. Adams et al. in “The final case of the decoding delay problem for maximum rate complex orthogonal designs,” IEEE Trans. Inf. Theory,...

متن کامل

Memoryless RNS-to-binary converters for the {2n+1 - 1, 2n, 2n - 1} moduli set

In this paper, we propose two novel memoryless reverse converters for the moduli set {2 − 1, 2, 2 − 1}. The first proposed converter does not entirely cover the dynamic range while the second proposed converter covers the entire dynamic range. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that utilizes mod-(2 − 1) operation. Second, we further reduce th...

متن کامل

Almost Every Tree With m Edges Decomposes K 2m, 2m

We show that asymptotically almost surely a tree with m edges decomposes the complete bipartite graph K 2m,2m , a result connected to a conjecture of Graham and Häggkvist. The result also implies that asymptotically almost surely a tree with m edges decomposes the complete graph with O(m 2) edges. An ingredient of the proof consists in showing that the bipartition classes of the base tree of a ...

متن کامل

N = 2 Superstrings with (1, 2m) Spacetime Signature

We show that the N = 2 superstring in d = 2D ≥ 6 real dimensions, with criticality achieved by including background charges in the two real time directions, exhibits a " coordinate-freezing " phenomenon, whereby the momentum in one of the two time directions is constrained to take a specific value for each physical state. This effectively removes this time direction as a physical coordinate, le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sādhanā

سال: 2019

ISSN: 0256-2499,0973-7677

DOI: 10.1007/s12046-019-1078-0